Task attribute assignment of fixed priority scheduled tasks to reenact off-line schedules

نویسندگان

  • Radu Dobrin
  • Yusuf Özdemir
  • Gerhard Fohler
چکیده

A number of industrial applications advocate the use of time triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-end deadlines. The rigid offline scheduling schemes used for time triggered systems, however, do not provide for flexibility. Fixed priority scheduling can provide more flexibility, but is limited with respect to predictability, as actual times of executions depend on run-time events. In this paper, we present a method to combine off-line schedule construction with fixed priority scheduling: by determining task attributes for the off-line scheduled tasks, such that the original schedule is reconstructed if scheduled with FPS at run-time. It analyzes an off-line schedule together with original task constraints to create sequences and windows of tasks. Priorities and offsets are set to ensure task orders in sequences and relation between windows. As FPS cannot reconstruct all schedules with periodic tasks, our algorithm can split tasks into several instances to achieve consistent task attributes. Lower priority tasks can be added for runtime use.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Attribute Assignment for the Integration of Off-line and Fixed Priority Scheduling

In this paper we present work to combine fixed priority scheduling with off-line schedule construction.It assumes a schedule has been constructed off-line for a set of tasks to meet their complex constraints.Our method takes the schedule and assigns the FPS attributes priority, offset, and period, to the tasks, such that their runtime FPS execution matches the off-line schedule.It does so by di...

متن کامل

Optimal Priority Assignment for Aperiodic Tasks with Firm Deadlines in Fixed Priority Pre-Emptive Systems

An optimal priority assignment policy is presented for independent aperiodic tasks with arbitrary ready times and firm deadlines, scheduled on a uniprocessor along with a set of hard periodic/sporadic tasks. The latter tasks are assumed to have been assigned unique fixed priorities according to some arbitrary policy and guaranteed, via off-line feasibility analysis, to meet their deadlines. In ...

متن کامل

Scheduling Fixed-Priority Hard Real-Time Tasks in the Presence of Faults

We describe an approach to scheduling hard real-time tasks taking into account fault scenarios. All tasks are scheduled at run-time according to their fixed priorities, which are determined off-line. Upon error-detection, special tasks are released to perform error-recovery actions. We allow error-recovery actions to be executed at higher priority levels so that the fault resilience of the task...

متن کامل

Translating Off-Line Schedules into Task Attributes for Fixed Priority Scheduling

Off-line scheduling and fixed priority scheduling (FPS) are often considered as complementing and incompatible paradigms. A number of industrial applications demand temporal properties (predictability, jitter constraints, endto-end deadlines, etc.) that are typically achieved by using off-line scheduling. The rigid off-line scheduling schemes used, however, do not provide for flexibility. FPS h...

متن کامل

Multiprocessor Scheduling For Real Time Systems Embedded Systems

energy-ef?cient tasks scheduling algorithm for real-time utility accrual real-time scheduling for multiprocessor multiprocessor real-time scheduling in industrial embedded a novel approach for off-line multiprocessor scheduling in multiprocessor scheduling for real time systems embedded robust partitioned scheduling for realtime multiprocessor multiprocessor scheduling for real time systems emb...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000